Document image decoding approach to character template estimation

نویسندگان

  • Gary E. Kopec
  • Mauricio Lomelin
چکیده

Template Estimation 1 Gary E. Kopec2 Xerox Palo Alto Research Center Mauricio Lomelin3 Microsoft Corp. November 29, 1995 Abstract This paper develops an approach to supervised training of character templates from page images and unaligned transcriptions. The template estimation problem is formulated as one of constrained maximum likelihood parameter estimation within the document image decoding framework. This leads to a two-phase iterative training algorithm consisting of transcription alignment and aligned template estimation (ATE) steps. The maximum likelihood ATE problem is shown to be NP-complete and thus a number of simple suboptimal solutions are developed. The training procedure is illustrated by its use in creating a document-specific decoder for high-accuracy transcription of a large (400 page) text document. Depending on the language model used, the decoder character error rate is a factor of 7–20 less than that of a commercial omni-font OCR program; the best case error rate is 0.036%.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supervised Template Estimation for Document Image Decoding

Gary E. Kopec, Member, IEEE, and Mauricio Lomelin, Member, IEEE July 20, 1997 Abstract An approach to supervised training of character templates from page images and unaligned transcriptions is proposed. The template training problem is formulated as one of constrained maximum likelihood parameter estimation within the document image decoding framework. This leads to a three-phase iterative tra...

متن کامل

Document-specific character template estimation

An approach to supervised training of document-specific character templates from sample page images and unaligned transcriptions is presented. The template estimation problem is formulated as one of constrained maximum likelihoodparameter estimation within the document image decoding (DID) framework. This leads to a two-phase iterative training algorithm consisting of transcriptionalignment and...

متن کامل

Document Image Decoding Using Iterated Complete Path Search with Subsampled Heuristic Scoring

It has been shown that the computation time of Document Image Decoding can be significantly reduced by employing heuristics in the search for the best decoding of a text line. In the Iterated Complete Path (ICP) method, template matches are performed only along the best path found by dynamic programming on each iteration. When the best path stabilizes, the decoding is optimal and no more templa...

متن کامل

Document image decoding using iterated complete path search

The computation time of Document Image Decoding can be significantly reduced by employing heuristics in the search for the best decoding of a text line. By using a cheap upper bound on template match scores, up to 99.9% of the potential template matches can be avoided. In the Iterated Complete Path method, template matches are performed only along the best path found by dynamic programming on e...

متن کامل

Document Image Decoding Using Markov Source Models

This paper describes a communication theory approach to document image recognition, patterned after the use of hidden Markov models in speech recognition. In general, a document recognition problem is viewed as consisting of three elements— an image generator, a noisy channel and an image decoder. A document image generator is a Markov source (stochastic finite-state automaton) that combines a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996